Modal Theorem Proving
نویسندگان
چکیده
We describe resolution proof systems for several modal logics. First we present the propo-sitional versions of the systems and prove their completeness. The first-order resolution rule for classical logic is then modified to handle quantifiers directly. This new resolution rule enables us to extend our propositional systems to complete first-order systems. The systems for the different modal logics are closely related.
منابع مشابه
Identity in modal logic theorem proving
THINKER is an automated natural deduction first-order theorem proving program. This paper reports on how it was adapted so as to prove theorems in modal logic. The method employed is an "indirect semantic method", obtained by considering the semantic conditions involved in being a valid argument in these modal logics. The method is extended from propositional modal logic to predicate modal logi...
متن کاملThe QMLTP Problem Library for First-Order Modal Logics
The Quantified Modal Logic Theorem Proving (QMLTP) library provides a platform for testing and evaluating automated theorem proving (ATP) systems for first-order modal logics. The main purpose of the library is to stimulate the development of new modal ATP systems and to put their comparison onto a firm basis. Version 1.1 of the QMLTP library includes 600 problems represented in a standardized ...
متن کاملThe QMLTP Library: Benchmarking Theorem Provers for Modal Logics
The Quantified Modal Logic Theorem Proving (QMLTP) library provides a platform for testing and evaluating automated theorem proving (ATP) systems for first-order modal logics. The main purpose of the library is to foster the development of new ATP systems and to put their comparison onto a firm basis. The current version 1.0 of the QMLTP library includes 500 problems represented in a standardiz...
متن کاملTree-Based Heuristics in Modal Theorem Proving
We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas. We provide both the mathematical underpinnings and experimental results concerning our improved translation method.
متن کاملTree-based Heuristics in Modal Theorem Proving
We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas. We provide both the mathematical underpinnings and experimental results concerning our improved translation method.
متن کاملDistributed Modal Theorem Proving with KE
This paper describes an approach to distributed modal theorem proving by bringing together and exploiting two software packages. The rst is the implementation of a theorem prover for normal modal logics based on KE and a generalization of Fitting's preexed tableaux. The second is a library for implementing brokered inter-process communication over the internet. We describe three demonstrators w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986